Uncertainty in Multi-Commodity Routing Networks: When does it help?
نویسندگان
چکیده
We study the equilibrium quality under user uncertainty in a multi-commodity selfish routing game with many types of users, where each user type experiences a different level of uncertainty. We consider a new model of uncertainty where each user over or under-estimates their congestion costs by a multiplicative constant. We present a variety of theoretical results showing that when users under-estimate their costs, the network congestion decreases at equilibrium, whereas overestimation of costs leads to increased equilibrium congestion. Motivated by applications in urban transportation networks, we perform simulations consisting of parking users and through traffic on synthetic and realistic network topologies. In light of the dynamic pricing policies adopted by network operators to tackle congestion, our results indicate that while users’ perception of these prices can significantly impact the policy’s efficacy, optimism in the face of uncertainty leads to favorable network conditions.
منابع مشابه
Model and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کاملMulti-Objective Location-Routing Model With Multiple Transportation Modes For Designing Relief Networks Under Uncertainty
A three-level relief chain including a number of suppliers in fixed locations, candidate distribution centers and affected areas at certain points are considered. A mixed integer nonlinear programming model is proposed for open transportation location routing problem by considering split delivery of demand. To solve a realistic problem, foregoing parameters are considered as fuzzy in our propos...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1709.08441 شماره
صفحات -
تاریخ انتشار 2017